A Method for Inverting the Channel Matrix in R-Matrix Theory
نویسندگان
چکیده
منابع مشابه
Efficient Recursion Method for Inverting Overlap Matrix
A new O(N) algorithm based on a recursion method, in which the computational effort is proportional to the number of atoms N , is presented for calculating the inverse of an overlap matrix which is needed in electronic structure calculations with the the non-orthogonal localized basis set. This efficient inverting method can be incorporated in several O(N) methods for diagonalization of a gener...
متن کاملBrief Review of the R-Matrix Theory
Resonance theory deals with the description of the nucleon-nucleus interaction and aims at the prediction of the experimental structure of cross sections. Resonance theory is basically an interaction model which treats the nucleus as a black box, whereas nuclear models are concerned with the description of the nuclear properties based on models of the nuclear forces (nuclear potential). Any the...
متن کاملSinc operational matrix method for solving the Bagley-Torvik equation
The aim of this paper is to present a new numerical method for solving the Bagley-Torvik equation. This equation has an important role in fractional calculus. The fractional derivatives are described based on the Caputo sense. Some properties of the sinc functions required for our subsequent development are given and are utilized to reduce the computation of solution of the Bagley-Torvik equati...
متن کاملA New Recursive Algorithm For Inverting A General Comrade Matrix
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n). The algorithm is implementable to the Computer Algebra System (CAS) such as MAPLE, MATLAB and MATHEMATICA. Three examples are presented for the sake of illustration.
متن کاملA deterministic algorithm for inverting a polynomial matrix
Improved cost estimates are given for the problem of computing the inverse of an n×n matrix of univariate polynomials over a field. A deterministic algorithm is demonstrated that has worst case complexity (n3s) field operations, where s ≥ 1 is an upper bound for the average column degree of the input matrix. Here, the “+o(1)” in the exponent indicates a missing factor c1(log ns)2 for positive r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Australian Journal of Physics
سال: 1972
ISSN: 0004-9506
DOI: 10.1071/ph720253